Communication‐aware distributed rebalancing for cooperative car‐sharing service

Abstract This study presents a cooperative car‐sharing system in which various service providers jointly operate sharing service. A distributed algorithm is proposed for rebalancing control to reduce deadhead vehicles as much possible under the constraints of dispatchable and parking slots at car stations. Each provider cooperatively searches optimal solution by exchanging estimated values dual solutions over communication networks between providers. Event‐driven considered information exchange with neighboring performed only when amount change exceeds threshold. Numerical instances explain that estimations all meet solutions.